The sequencing game
نویسندگان
چکیده
منابع مشابه
An m-sequencing game with an empty core
We study m-sequencing games, which were introduced by Hamers et al. (1999). We answer the open question whether all these games are balanced in the negative. We do so, by an example of a 3-sequencing situation with 5 jobs, whose associated 3-sequencing game has an empty core. The counterexample finds its basis in an inconsistency in Hamers et al. (1999), which was probably overlooked by the aut...
متن کاملTheory as Game: Designing the Game Game
ABSTRACT Is there a way to analyze games by the means of a game? Is there a way to brainstorm game ideas and design solutions through theory? Finnish scholar and game designer Aki Järvinen presents an approach where a card game meets design meets game studies. The approach presented in the paper is similar to Scott McCloud’s Understanding Comics: a theory of comics in the form of a comic book. ...
متن کاملThe Effects of Adaptive Sequencing Algorithms on Player Engagement within an Online Game
Using the online educational game Battleship Numberline, we have collected over 8 million number line estimates from hundreds of thousands of players. Using random assignment, we evaluate the effects of various adaptive sequencing algorithms on player engagement and learning.
متن کاملMinimizing the Mean Tardiness in A N1 Sequencing Problem
This paper considers the problem of minimizing the mean tardiness of N jobs when the jobs are scheduled on a single machine. A simple algorithmic procedure is develop to obtain an optimal or a near optimal sequence for the N jobs while considering an equal penalty cost incurred to each job delivered later than its due date. The developed algorithm is applied to the several test problems. The re...
متن کاملOn the Computational Complexity of the Domination Game
The domination game is played on an arbitrary graph $G$ by two players, Dominator and Staller. It is known that verifying whether the game domination number of a graph is bounded by a given integer $k$ is PSPACE-complete. On the other hand, it is showed in this paper that the problem can be solved for a graph $G$ in $mathcal O(Delta(G)cdot |V(G)|^k)$ time. In the special case when $k=3$ and the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nature Reviews Genetics
سال: 2009
ISSN: 1471-0056,1471-0064
DOI: 10.1038/nrg2646